Weighted Minmax Algorithm for Color Image Quantization

نویسنده

  • Paula J. Reitan
چکیده

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSE, whereby obtaining high quality quantized images with significantly less visual distortion than the MinMax algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Color image quantization using weighted distortion measure of HVS color activity

Color quantization is to design a color palette having almost no noticeably perceived difference between original and quantized images. In this paper, to design such a palette, the color quantization algorithm is considered in two parts: the selection of a proper distortion measure and the design of an optimal palette. The proper selection of distortion measure in the quantization is important ...

متن کامل

Image Compression Based on Wavelet and Quantization with Optimal Huffman Code

This paper proposes a method for the compression of color images by Haar transform, quantization and construction of minimum redundancy code using conventional Huffman coding. Wavelet compression is accomplished by decomposing the row and column of the image matrix using the Harr transform. And the reconstruction of the image is feasible just from 1/4 of the decomposed image and even 1/16 of th...

متن کامل

Image Indexing Using Weighted Color Histogram

Image indexing is the process of image retrieval from databases of images or videos based on their contents. Specifically, histogram-based algorithms are considered to be effective for color image indexing. We suggest a new method of color space quantization in the CIELUV color space, named weighted LUV quantization. With this method, each bin in the LUV space has a different weighting factor, ...

متن کامل

Integrating Color Vector Quantization and Curvelet Transform for Image Retrieval

Since most of image databases today are pooly indexed or annotated, there is a great need for developing automated, content-based image retrieval (CBIR) systems to help users to get images they want. The focus of our research is mining image features which can represent image in the way of human visual perception. Our image retrieval approach depends on the extracted color and shape features. V...

متن کامل

Fast Color Quantization Using Weighted Sort-Means Clustering

Color quantization is an important operation with numerous applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, K-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999